Coupling Elephant Herding with Ordinal Optimization for Solving the Stochastic Inequality Constrained Optimization Problems
نویسندگان
چکیده
منابع مشابه
An Optimization K-Modes Clustering Algorithm with Elephant Herding Optimization Algorithm for Crime Clustering
The detection and prevention of crime, in the past few decades, required several years of research and analysis. However, today, thanks to smart systems based on data mining techniques, it is possible to detect and prevent crime in a considerably less time. Classification and clustering-based smart techniques can classify and cluster the crime-related samples. The most important factor in the c...
متن کاملSolving Chance-Constrained Optimization Problems with Stochastic Quadratic Inequalities
We study a complex class of stochastic programming problems involving a joint chance constraint with random technology matrix and stochastic quadratic inequalities. We present a basic mixedinteger nonlinear reformulation based on Boolean modeling and derive several variants of it. We present detailed empirical results comparing the various reformulations and several easy to implement algorithmi...
متن کاملOptimization Approaches for Solving Chance Constrained Stochastic Orienteering Problems
Orienteering problems (OPs) are typically used to model routing and trip planning problems. OP is a variant of the well known traveling salesman problem where the goal is to compute the highest reward path that includes a subset of nodes and has an overall travel time less than the specified deadline. Stochastic orienteering problems (SOPs) extend OPs to account for uncertain travel times and a...
متن کاملSolving Constrained Nonlinear Optimization Problems with Particle Swarm Optimization
This paper presents a Particle Swarm Optimization (PSO) algorithm for constrained nonlinear optimization problems. In PSO, the potential solutions, called particles, are "flown" through the problem space by learning from the current optimal particle and its own memory. In this paper, preserving feasibility strategy is employed to deal with constraints. PSO is started with a group of feasible so...
متن کاملOrdinal Optimization Approach to Stochastic Simulation Optimization Problems and Applications
In this paper, we propose an ordinal optimization approach to solve for a good enough solution of the stochastic simulation optimization problem with huge decision-variable space. We apply the proposed ordinal optimization algorithm to G/G/1/K polling systems to solve for a good enough number-limited service discipline to minimize the weighting average waiting time. We have compared our results...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Sciences
سال: 2020
ISSN: 2076-3417
DOI: 10.3390/app10062075